Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges
نویسندگان
چکیده
We present a 10 7 -approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.
منابع مشابه
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow
A parity subgraph of a graph is a spanning subgraph such that the degrees of all vertices have the same parity in both the subgraph and the original graph. Let G be a cyclically 6-edge-connected cubic graph. Steffen (Intersecting 1-factors and nowhere-zero 5-flows 1306.5645, 2013) proved that G has a nowhere-zero 5-flow if G has two perfect matchings with at most two intersections. In this pape...
متن کاملGenerating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every K we can generate K (or all) minimal 3-vertex connected spanning subgraphs of a given graph in O(K2log(K)m2 +K2m3) time, where n and m are the number of vertices and edges of the input graph, respec...
متن کاملA tight bound on the collection of edges in MSTs of induced subgraphs
Let G = (V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that for k ∈ {1, 2, . . . , n − 1}, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of G with n − k + 1 vertices has at most nk − ( k+1 2 ) elements. This proves a conjecture of Goemans and Vondrak [1]. We also show that the result is a generalization of Mader’s T...
متن کاملSparse highly connected spanning subgraphs in dense directed graphs
Mader (1985) proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, and this is sharp. For dense strongly $k$-connected digraphs, the bound can be significantly improved for dense strongly $k$-connected digraphs. Let $\overline{\Delta}(D)$ be the maximum degree of the complement of the underlying undirecte...
متن کاملSupereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 31 شماره
صفحات -
تاریخ انتشار 2017